On Hamiltonicity of Vertex-Transitive Graphs and Digraphs of Orderp4
نویسندگان
چکیده
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملExponents of vertex-transitive digraphs
A digraph D is primitive if, for some positive integer r, there is a u ! v walk of length r for every pair u; v of vertices of D. The minimum such r is called the exponent of D, denoted exp(D). We prove that if a primitive digraph D of order n is an Abelian Cayley digraph with degree k 4, then exp(D) max n 5; n dk=2e 1 o : If we assume only that the primitive digraph D is vertex-transitive, the...
متن کاملOn Vosperian and Superconnected Vertex-Transitive Digraphs
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.
متن کاملvertex removable cycles of graphs and digraphs
in this paper we defined the vertex removable cycle in respect of the following, if $f$ is a class of graphs(digraphs) satisfying certain property, $g in f $, the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $. the vertex removable cycles of eulerian graphs are studied. we also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملOn Isomorphisms of Vertex-transitive Graphs
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1998
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1796